Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of comp...
متن کاملRouting in Ad-Hoc Networks Using Minimum Connected Dominating Sets
1 Motivation An ad-hoc network is a multihop wireless network in which mobile hosts communicate over a shared, scarce wireless channel. An ad-hoc network is characterized by the absence of a wired backbone or any sort of centralized network management system to maintain routes as hosts move or turn oo or on. Since routes change quickly not only because end nodes move but also because intermedia...
متن کاملConstructing Minimum Connected Dominating Set: Algorithmic approach
Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hulls of sensor nodes or vertices. Constructing a virtual backbone in WSNs is an important issue because it red...
متن کاملOn constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Previous work in this area has focused on selecting a small virtual backbone for high efficiency. In this paper, we propose the construction of a k-connected k-dominating set (k-CDS) as a backbone to balance efficiency and...
متن کاملClustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the most important issues in wireless ad hoc networks. The weakly connected dominating set (WCDS) is very suitable for cluster formation. As finding th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks
سال: 2012
ISSN: 0975-7260
DOI: 10.5121/jgraphoc.2012.4202